Sandpile groups and Laplacian matrices
نویسندگان
چکیده
Proof: (R ⊂ κ(G, s)). Let I ⊂ M(G, s) be a nonempty ideal. Fix ψ ∈ I. Given σ ∈ R, there exists a sandpile φ such that σ = (φ + ψ)◦ by defintion. Since I is an ideal, this implies that σ ∈ I. Hence R ⊂ I. We conclude that R ⊂ ⋂ I ideal of M(G,s) I = κ(G, s). (κ(G, s) ⊂ R). Recall that R 6= ∅. Since κ(G, s) is the minimal ideal of M(G, s), it is enough to show that R is an ideal. Consider σ ∈ R and τ ∈ M(G, s). We want to show that (σ+τ)◦ is recurrent. Let ψ ∈M(G, s) and choose a sandpile φ such that σ = (ψ+φ)◦. Set φ′ = φ+ τ . By the abelian property of sandpile stabilization, we have (ψ + φ′)◦ = (ψ + φ+ τ)◦ = ((ψ + φ)◦ + τ)◦ = (σ + τ)◦.
منابع مشابه
Degree and Algebraic Properties of Lattice and Matrix Ideals
We study the degree of nonhomogeneous lattice ideals over arbitrary fields, and give formulas to compute the degree in terms of the torsion of certain factor groups of Zs and in terms of relative volumes of lattice polytopes. We also study primary decompositions of lattice ideals over an arbitrary field using the Eisenbud–Sturmfels theory of binomial ideals over algebraically closed fields. We ...
متن کاملChip firing on Dynkin diagrams and McKay quivers
Two classes of avalanche-finite matrices and their critical groups (integer cokernels) are studied from the viewpoint of chip-firing/sandpile dynamics, namely, the Cartan matrices of finite root systems and the McKay-Cartan matrices for finite subgroups G of general linear groups. In the root system case, the recurrent and superstable configurations are identified explicitly and are related to ...
متن کاملConcrete and abstract structure of the sandpile group for thick trees with loops
We answer a question of László Babai concerning the abelian sandpile model. Given a graph, the model yields a finite abelian group of recurrent configurations which is closely related to the combinatorial Laplacian of the graph. We explicitly describe the group elements and operations in the case of thick trees with loops—that is, graphs which are obtained from trees by setting arbitrary edge m...
متن کاملDiscrete Mathematics : The Abelian Sandpile Model
Exercise 7. Let A be an n × n matrix such that the sum of every row is 0 and the sum of every column is 0. Let Aij be the (n − 1) × (n − 1) matrix obtained by removing row i and column j from A. Prove: det(Aij) = (−1) det(A11). (Note that this result applies in particular to the Laplacian L: the determinant of the reduced Laplacian, obtained by removing the i-th row and the i-th column from L, ...
متن کاملOn the sandpile group of regular trees
The sandpile group of a connected graph is the group of recurrent configurations in the abelian sandpile model on this graph. We study the structure of this group for the case of regular trees. A description of this group is the following: Let T (d, h) be the d-regular tree of depth h and let V be the set of its vertices. Denote the adjacency matrix of T (d, h) by A and consider the modified La...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011